Safe Browsing in a Strongly Typed Persistent Environment

Safe Browsing in a Strongly Typed Persistent Environment

The need to examine data structures often occurs in programming language and database management systems. In this paper we describe how a browser for a strongly typed programming language ( PS-algol ) may be written in a type secure manner in a closed persistent environment. This is achieved without resorting to magic or having to break the type rules of the language by exploiting a compiler th...

Persistent Programming with Strongly Typed Linguistic Reflection

The technique of linguistic reflection is of particular interest in persistent systems because it can allow longlived data and programs to evolve in a type-safe manner. Existing reflective languages are hard to use because programs contain a mixture of several different kinds of code, with respect to their role in reflection. In some systems this problem is compounded by the presence of a high ...

GOM: A Strongly Typed Persistent Object Model With Polymorphism

Strongly typed, compile-time safe and loosely coupled data persistence

A large number of approaches have been developed to simplify construction of, and to reduce errors in, data-driven applications. However, these approaches have not been particularly concerned with compile-time type safety. Type mismatch errors between program and the database schema occur quite often during program development, and the techniques used in these approaches often defer error check...

Strongly Typed Genetic Programming

Genetic programming is a powerful method for automatically generating computer programs via the process of natural selection (Koza, 1992). However, in its standard form, there is no way to restrict the programs it generates to those where the functions operate on appropriate data types. In the case when the programs manipulate multiple data types and contain functions designed to operate on par...